Search results for "Genetic algorithm scheduling"

showing 4 items of 4 documents

A FAST Method to Achieve Flexible Production Programming Systems

2008

One of the main critical problems in manufacturing system domains is the production scheduling process, because an agile and reactive production planning and scheduling system is essential in manufacturing. The production scheduling process is a complex problem in which finding a suitable production scheduling can greatly increase the effectiveness of highly flexible production processes. Nevertheless, this high flexibility makes the production scheduling and acquisition of relevant data quite complicated. Therefore, there is a strong demand for a universal and flexible tool for production scheduling capable of increasing the utilization of resources and that supports a decision-making proc…

Job shop schedulingComputer scienceDistributed computingReal-time computingFlexible manufacturing systemScheduling (production processes)Dynamic priority schedulingFair-share schedulingComputer Science ApplicationsScheduling (computing)Human-Computer InteractionProduction planningControl and Systems EngineeringGenetic algorithm schedulingTwo-level schedulingScalabilityResource managementElectrical and Electronic EngineeringSoftwareInformation SystemsIEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
researchProduct

Economic lot scheduling on multiple production lines with resource constraints

2003

Abstract This paper deals with the multiple production line economic lot scheduling problem, where some items cannot be produced concurrently since they compete for some discrete resources. In particular, cyclic schedules are sought for a problem where identical production lines are present, lost sales are allowed, and minimization of the long-range production, setup, inventory, and shortage penalty costs are required. A heuristic procedure for this problem is introduced, a numerical example is worked out and some computational experiments are presented.

Production lineEconomics and EconometricsMathematical optimizationResource constraintsScheduling (production processes)Management Science and Operations ResearchGeneral Business Management and AccountingIndustrial and Manufacturing EngineeringEconomic lot scheduling problemFair-share schedulingGenetic algorithm schedulingEconomicsMinificationHeuristicsInternational Journal of Production Economics
researchProduct

Looking for the best modes helps solving the MRCPSP/max

2013

The multi-mode resource-constrained project scheduling problem with minimum and maximum time lags MRCPSP/max is a very general project scheduling problem with multiple execution modes per activity, renewable and non-renewable resources and minimum and maximum time lags between activities. In this paper, we describe SA-EVA, an algorithm for the problem. SA-EVA first searches for the best mode for each activity, without considering renewable resources. In this phase a simulated annealing is applied. Once a mode vector has been chosen, the problem reduces to the RCPSP/max, which SA-EVA solves with EVA, an algorithm designed in Ballestin et al. [2009. An evolutionary algorithm for the resource-…

Rate-monotonic schedulingEarliest deadline first schedulingMathematical optimizationNurse scheduling problemComputer scienceGenetic algorithm schedulingStrategy and ManagementEvolutionary algorithmDynamic priority schedulingManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingScheduling (computing)International Journal of Production Research
researchProduct

Time and work generalised precedence relationships in project scheduling with pre-emption: An application to the management of Service Centres

2012

Abstract In this paper we present an application of project scheduling concepts and solution procedures for the solution of a complex problem that comes up in the daily management of many company Service Centres. The real problem has been modelled as a multi-mode resource-constrained project scheduling problem with pre-emption, time and work generalised precedence relationships with minimal and maximal time lags between the tasks and due dates. We present a complete study of work GPRs which includes proper definitions, a new notation and all possible conversions amongst them. Computational results that show the efficiency of the proposed hybrid genetic algorithm and the advantages of allowi…

Rate-monotonic schedulingService (systems architecture)Information Systems and ManagementPrecedence diagram methodGeneral Computer ScienceOperations researchComputer scienceDistributed computingDynamic priority schedulingSchedule (project management)Management Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingFixed-priority pre-emptive schedulingGenetic algorithm schedulingModeling and SimulationTwo-level schedulingEuropean Journal of Operational Research
researchProduct